New minimum distance bounds for linear codes over GF(5)
نویسندگان
چکیده
Let [n; k; d]q-codes be linear codes of length n, dimension k and minimum Hamming distance d over GF(q). In this paper, 32 new codes over GF(5) are constructed and the nonexistence of 51 codes is proved. c © 2003 Elsevier B.V. All rights reserved.
منابع مشابه
New linear codes over GF(8)1
Let [n, k, d]q-code be a linear code of length n, dimension k and minimum Hamming distance d over GF (q). One of the most important problems in coding theory is to construct codes with best possible minimum distances. Recently, the class of quasi-cyclic (QC) codes has been proven to contain many such codes. In this paper, thirty two codes over GF (8) are constructed (among them one optimal code...
متن کاملNew Ternary Linear Codes 1
Let n; k; d; q]-codes be linear codes of length n, dimension k and minimum Hamming distance d over GF (q). In this paper, eighteen codes are constructed which improve the known lower bounds on minimum distance.
متن کاملConstruction of (sometimes) Optimal Linear Codes
For the purpose of error correcting linear codes over a finite field GF (q) and fixed dimension k we are interested in codes with high minimum distance d as these allow the correction of up to b(d− 1)/2c errors. On the other hand we are interested in codes with minimum redundancy, i.e. codes of small length n. High minimum distance and small length are controversial goals for the optimization o...
متن کاملSome new quasi - twisted ternary linear codes ∗
Let [n, k, d]q code be a linear code of length n, dimension k and minimum Hamming distance d over GF (q). One of the basic and most important problems in coding theory is to construct codes with best possible minimum distances. In this paper seven quasi-twisted ternary linear codes are constructed. These codes are new and improve the best known lower bounds on the minimum distance in [6]. 2010 ...
متن کاملNew Good Quasi-cyclic Codes over Gf(3)
Abstract In this paper some good quasi-cyclic codes over GF(3) are presented. These quasi-cyclic codes improve the already known lower bounds on the minimum distance of the previously known quasi-cyclic codes. Even though these codes do not improve the minimum distance of the best unstructured code known, their beautiful structure and simplicity provide several advantages in comparison to other...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Probl. Inf. Transm.
دوره 40 شماره
صفحات -
تاریخ انتشار 2004